ON THE ‐COMPLETENESS AND ‐COMPLETENESS OF MULTIFRACTAL DECOMPOSITION SETS
نویسندگان
چکیده
منابع مشابه
On Completeness of Pseudodimple Sets
The paper contains completeness criterions for pseudosimple sets. Those criterions are constructed using e ectivization of the de nitions as well as extensionally bounded functions.
متن کاملOn Probabilistic Completeness of Probabilistic Cell Decomposition
Probabilistic Cell Decomposition (PCD) is a probabilistic path planning method combining the concepts of approximate cell decomposition with probabilistic sampling. It has been shown that the use of lazy evaluation techniques and supervised sampling in important areas result in a high performance path planning method. Even if it was postulated before that PCD is probabilistically complete, we p...
متن کاملCompleteness and quasi-completeness
The appropriate general completeness notion for topological vector spaces is quasi-completeness. There is a stronger general notion of completeness, which proves to be too strong in general. For example, the appendix shows that weak-star duals of infinite-dimensional Hilbert spaces are quasi-complete, but never complete in the stronger sense. Quasi-completeness for Fréchet spaces is ordinary me...
متن کاملON COMPACTNESS AND G-COMPLETENESS IN FUZZY METRIC SPACES
In [Fuzzy Sets and Systems 27 (1988) 385-389], M. Grabiec in- troduced a notion of completeness for fuzzy metric spaces (in the sense of Kramosil and Michalek) that successfully used to obtain a fuzzy version of Ba- nachs contraction principle. According to the classical case, one can expect that a compact fuzzy metric space be complete in Grabiecs sense. We show here that this is not the case,...
متن کاملNP-Completeness of Minimum Rule Sets
Rule induction systems seek to generate rule sets which are optimal in the complexity of the rule set. This paper develops a formal proof of the NP-Completeness of the problem of generating the simplest rule set (MIN RS) which accurately predicts examples in the training set for a particular type of generalization algorithm algorithm and complexity measure. The proof is then informally extended...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematika
سال: 2018
ISSN: 0025-5793,2041-7942
DOI: 10.1112/s0025579317000365